Multiplierless Unity-Gain SDF FFTs
نویسندگان
چکیده
منابع مشابه
Multiplierless Implementation of Rotators and FFTs
Complex rotators are used in many important signal processing applications, including Cooley-Tukey and split-radix FFT algorithms. This paper presents methods for designing multiplierless implementations of fixed-point rotators and FFTs, in which multiplications are replaced by additions, subtractions, and shifts. These methods minimise the adder-cost (the number of additions and subtractions),...
متن کاملHigh-speed CMOS unity-gain current amplifier
A high-performance CMOS unity-gain current amplifier is proposed. The solution adopts two feedback loops to reduce the input resistance and a nested-Miller technique to provide frequency compensation. A design example using a 0.8 mm process and a 2V supply is given and SPICE simulations show a bandwidth of 75MHz, no slew-rate limitations and a settling time better than 50 ns, irrespective of th...
متن کاملAutomatic gain Control for Unity Feedback Control Systems
In this paper, an automatic gain control scheme is first proposed for analyses and designs of unity feedback control systems. The controlled system is a nonlinear feedback control system. The overall system is equivalent to a conventional automatic gain control loop with command tracking error input. Therefore, it gives good command tracking behaviour while keeping robust characteristic of the ...
متن کاملA New Low-Voltage, Low-Power and High-Slew Rate CMOS Unity-Gain Buffer
Class-AB circuits, which are able to deal with currents several orders of magnitude larger than their quiescent current, are good candidates for low-power and high slew-rate analog design. This paper presents a novel topology of a class AB flipped voltage follower (FVF) that has better slew rate and the same power consumption as the conventional class-AB FVF buffer previously presented in liter...
متن کاملMultiprocessor FFTs
Several multiprocessor FFTs are developed in this paper for both vector multiprocessors with shared memory and the hypercube. Two FFTs for vector multiprocessors are given that compute an ordered transform and have a stride of one except for a single "link" step. Since multiple FFTs provide additional options for both vectorization and distribution we show that a single FFT can be performed in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
سال: 2016
ISSN: 1063-8210,1557-9999
DOI: 10.1109/tvlsi.2016.2542583